Wavelet based preconditioners for sparse linear systems

نویسندگان

  • B. V. Rathish Kumar
  • Mani Mehra
چکیده

A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equations (PDEs) in a wide variety of scientific and engineering disciplines are introduced. Complete and Incomplete Discrete Wavelet Transforms in conjunction with row and column permutations are used in the construction of these preconditioners. With these Wavelet Transform, the transformed matrix is permuted to band forms. The efficiency of our preconditioners with several Krylov subspace methods is illustrated by solving matrices from Harwell Boeing collection and Tim Davis collection. Also matrices resulting in the solution of Regularized Burgers Equation, free convection in porous enclosure are tested. Our results indicate that the preconditioner based on Incomplete Discrete Haar Wavelet Transform is both cheaper to construct and gives good convergence. 2005 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biorthogonal Wavelet Based Algebraic Multigrid Preconditioners for Large Sparse Linear Systems

In this article algebraic multigrid as preconditioners are designed, with biorthogonal wavelets, as intergrid operators for the Krylov subspace iterative methods. Construction of hierarchy of matrices in algebraic multigrid context is based on lowpass filter version of Wavelet Transform. The robustness and efficiency of this new approach is tested by applying it to large sparse, unsymmetric and...

متن کامل

Wavelet-based Preconditioners for Dense Matrices with Non-smooth Local Features

We present algorithms for the detection of local non-smooth features within a dense matrix and show how, by isolating such features, we are able to use wavelet compression to design preconditioners for the corresponding dense linear system. We illustrate our approach with examples from the solution of Elastohydrodynamic Lubrication problems and Boundary Integral Equations.

متن کامل

CAS WAVELET METHOD FOR THE NUMERICAL SOLUTION OF BOUNDARY INTEGRAL EQUATIONS WITH LOGARITHMIC SINGULAR KERNELS

In this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the Laplacian equation. Themethod is based on the use of the Galerkin method with CAS wavelets constructed on the unit interval as basis.This approach utilizes the non-uniform Gauss-Legendre quadrature rule for ...

متن کامل

Multipole-based preconditioners for large sparse linear systems

Dense operators for preconditioning sparse linear systems have traditionally been considered infeasible due to their excessive computational and memory requirements. With the emergence of techniques such as block low-rank approximations and hierarchical multipole approximations, the cost of computing and storing these preconditioners has reduced dramatically. This paper describes the use of mul...

متن کامل

Some Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods

In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 171  شماره 

صفحات  -

تاریخ انتشار 2005